MCMC Methods For Discrete Sojourn Time

نویسندگان

  • Y. Cai
  • J. B. Kadane
چکیده

Ion channels are protein molecules that are intimately involved in the transmission of information through the nervous system. Their behaviour is modelled as a Markov chain, but one which cannot be observed directly. The deeciencies of the observation process make the study of ion channel data diicult. Several methods have been proposed for making inference about the parameters of the underlying Markov chain, but all are computationally expensive, even on simple models. We propose a new method based on Markov chain Monte Carlo technology in a Bayesian framework. Although this is also computationally intensive, it is possible that it may be extended to more complex models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A decomposition approach for the analysis of discrete- time queuing networks with finite buffers

This paper describes an approximation procedure for determining the throughput time distribution of material handling and service systems modeled as queuing networks. We consider finite buffer capacities and general distributed processing times in terms of discrete probability functions. In order to quantify the influence of blocking caused by finite buffers, we present a decomposition approach...

متن کامل

MCMC for continuous-time discrete-state systems

We propose a simple and novel framework for MCMC inference in continuoustime discrete-state systems with pure jump trajectories. We construct an exact MCMC sampler for such systems by alternately sampling a random discretization of time given a trajectory of the system, and then a new trajectory given the discretization. The first step can be performed efficiently using properties of the Poisso...

متن کامل

The use of simple reparameterizations to improve the efficiency of Markov chain Monte Carlo estimation for multilevel models with applications to discrete time survival models

We consider the application of Markov chain Monte Carlo (MCMC) estimation methods to random-effects models and in particular the family of discrete time survival models. Survival models can be used in many situations in the medical and social sciences and we illustrate their use through two examples that differ in terms of both substantive area and data structure. A multilevel discrete time sur...

متن کامل

Markov Chain Monte Carlo Estimation of Exponential Random Graph Models

This paper is about estimating the parameters of the exponential random graph model, also known as the p∗ model, using frequentist Markov chain Monte Carlo (MCMC) methods. The exponential random graph model is simulated using Gibbs or MetropolisHastings sampling. The estimation procedures considered are based on the Robbins-Monro algorithm for approximating a solution to the likelihood equation...

متن کامل

On Sojourn times in the M/m/1-ps Model, Conditioned on the Number of Other Users

We consider the M/M/1-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn time distribution, using a discrete Green’s function. This is shown to be equivalent to some classic results of Pollaczeck and Vaulot from 1946. Then various ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997